The Toffoli-Hadamard Gate System: an Algebraic Approach
نویسندگان
چکیده
Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. The basic algebraic properties of this system have been studied in Dalla Chiara et al. (Foundations of Physics 39(6):559–572, 2009), where we have introduced the notion of Shi-Aharonov quantum computational structure. In this paper we propose an algebraic abstraction from the Hilbert-space quantum computational structures, by introducing the notion of Toffoli-Hadamard algebra. From an intuitive point of view, such abstract algebras represent a natural quantum generalization of both classical and fuzzy-like structures.
منابع مشابه
Toffoli gate and quantum correlations: a geometrical approach
By using a geometrical approach, we investigate the behavior of the Quantum Toffoli Gate (QTG) in connection to quantum correlations. Special attention is paid to states with maximally mixed marginals. Finally and in the same vein, we scrutinize the Hadamard gate.
متن کاملA Simple Proof that Toffoli and Hadamard are Quantum Universal
Recently Shi [15] proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a ’classical’ set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev’s universal set of gates [11], and discu...
متن کاملHigh-Fidelity Single-Shot Toffoli Gate via Quantum Control.
A single-shot Toffoli, or controlled-controlled-not, gate is desirable for classical and quantum information processing. The Toffoli gate alone is universal for reversible computing and, accompanied by the Hadamard gate, forms a universal gate set for quantum computing. The Toffoli gate is also a key ingredient for (nontopological) quantum error correction. Currently Toffoli gates are achieved ...
متن کاملA simple encoding of a quantum circuit amplitude as a matrix permanent
In a recent article [1] Loebl and Moffatt gave a method for expressing the computation of the Jones polynomial of a braid in terms of a matrix permanent. Although computing permanents is believed difficult (#P-complete in the language of complexity theory), there exist probabilistic algorithms [2] which sample the permanent, and this suggests some interesting new classical algorithms for estima...
متن کاملAn Algorithm for Constructing Polynomial Systems Whose Solution Space Characterizes Quantum Circuits
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z2 arising when applying the Feynman’s sum-over-paths approach to quantum circuits. The matrix elements determined by a circuit can be computed by counting the number of common...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Philosophical Logic
دوره 42 شماره
صفحات -
تاریخ انتشار 2013